- Title
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
- Creator
- Mak, Vicky; Boland, Natashia
- Relation
- Discrete Optimization Vol. 3, Issue 1, p. 33-49
- Publisher Link
- http://dx.doi.org/10.1016/j.disopt.2005.10.003
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2006
- Description
- The Asymmetric Travelling Salesman Problem with Replenishment Arcs (RATSP) is a new class of problems arising from work related to aircraft routing. Given a digraph with cost on the arcs, a solution of the RATSP, like that of the Asymmetric Travelling Salesman Problem, induces a directed tour in the graph which minimises total cost. However the tour must satisfy additional constraints: the arc set is partitioned into replenishment arcs and ordinary arcs, each node has a non-negative weight associated with it, and the tour cannot accumulate more than some weight limit before a replenishment arc must be used. To enforce this requirement, constraints are needed. We refer to these as replenishment constraints. In this paper, we review previous polyhedral results for the RATSP and related problems, then prove that two classes of constraints developed in V. Mak and N. Boland [Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Technical Report TR M05/03, School of Information Technology, Deakin University, 2005] are, under appropriate conditions, facet-defining for the RATS polytope.
- Subject
- combinatorial optimisation; travelling salesman; polyhedral combinatorics
- Identifier
- http://hdl.handle.net/1959.13/939390
- Identifier
- uon:12796
- Identifier
- ISSN:1572-5286
- Language
- eng
- Reviewed
- Hits: 861
- Visitors: 805
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|